Bandwidth Scheduling for Wide - Area ATMNetworks Using Virtual

| This paper is concerned with the design of a class of bandwidth scheduling policies that are suitable for public, wide-area ATM networks. We specify design goals for such strategies including ease of implementation and the ability to guarantee minimum bandwidths to individual buuers. Packetized generalized processor sharing is brieey discussed and a minimum-bandwidth result for self-clocked fair queueing is given. We revisit an approach originally proposed by L. Zhang and prove that it is appropriate for ATM. Some novel, related approaches are described and analyzed.